Link Length of Rectilinear Hamiltonian Tours in Grids
نویسندگان
چکیده
The link length of a walk in a multidimensional grid is the number of straight line segments constituting the walk. Alternatively, it is the number of turns that a mobile unit needs to perform in traversing the walk. A rectilinear walk consists of straight line segments which are parallel to the main axis. We wish to construct rectilinear walks with minimal link length traversing grids. If G denotes the multidimensional grid, let s(G) be the minimal link length of a rectilinear walk traversing all the vertices of G. In this paper we develop an asymptotically optimal algorithm for constructing rectilinear walks traversing all the vertices of complete multidimensional grids and analyze the worst-case behavior of s(G), when G is a multidimensional grid. 1980 Mathematics Subject Classification: 68R05, 68R10 CR Categories: F.2.2, G.2.2
منابع مشابه
Improved Lower Bounds for the Link Length of Rectilinear Spanning Paths in Grids
We give improved lower bounds on the link length of spanning paths in a d-dimensional grid of size n. Kranakis et al. conjectured that the optimal link length is (1 + 1 d?1)n d?1 , but gave lower bounds not substantially larger than n d?1 ; we give a lower bound of (1 + 1 2d)n d?1 for all d > 2.
متن کاملAn Approximation Algorithm for the Two-Watchman Route in a Simple Polygon
The two-watchman route problem is that of computing a pair of closed tours in an environment so that the two tours together see the whole environment and some length measure on the two tours is minimized. Two standard measures are: the minmax measure, where we want the tours where the longest of them has minimal length, and the minsum measure, where we want the tours for which the sum of their ...
متن کاملUnit-length embedding of cycles and paths on grid graphs
Although there are very algorithms for embedding graphs on unbounded grids, only few results on embedding or drawing graphs on restricted grids has been published. In this work, we consider the problem of embedding paths and cycles on grid graphs. We give the necessary and sufficient conditions for the existence of cycles of given length k and paths of given length k between two given vertices ...
متن کاملFinding Maximum Length Tours Under Polyhedral Norms
We consider the traveling salesman problem when the cities are points in IR d for some xed d and distances are computed according to a polyhedral norm. We show that for any such norm, the problem of nding a tour of maximum length can be solved in polynomial time. If arithmetic operations are assumed to take unit time, our algorithms run in time O(n f+1), where f is the number of facets of the p...
متن کاملOptimal Intelligent Control of Plug-in Fuel Cell Electric Vehicles in Smart Electric Grids
In this paper, Plug-in Fuel Cell Electric Vehicle (PFCEV) is considered with dual power sources including Fuel Cell (FC) and battery Energy Storage. In order to respond to a transient power demand, usually supercapacitor energy storage device is combined with fuel cell to create a hybrid system with high energy density of fuel cell and the high power density of battery. In order to simulate the...
متن کامل